The Basics of Set Theory Sets Operations Equalities

Source URL: cl.indiana.edu

Computing the Width of a Point Set in 3-Spa e Thomas Herrmann Institute for Theoreti al Computer S ien e Institute for Operations Resear h

Source URL: people.inf.ethz.ch

• Graph theory
• Planar graph
• Randomized algorithm

Finding Four-Node Subgraphs in Triangle Time Virginia Vassilevska Williams∗ Joshua R. Wang† Abstract

Source URL: web.stanford.edu

• Graph theory
• NP-complete problems
• Graph operations
• Line graph
• Cograph
• Clique
• Neighbourhood
• Matching
• Hypergraph
• Independent set
• Graph
• Dominating set

Facility Operations Special-Event Rentals & Set-up Price List Wooden folding chairs $0.75/each

Source URL: servicerequests.cf.missouri.edu

management’s discussion and analysis OF FINANCIAL CONDITION AND RESULTS OF OPERATIONS Set forth below are our consolidated results for the years ended December 31, 2004 andResults included have been prepared in

Source URL: i2.esmas.com

• Economy
• Financial accounting
• Accounting
• Profit
• Fundamental analysis
• Asset
• Earnings before interest and taxes
• Net income
• Operating income before depreciation and amortization
• Book value
• Depreciation
• Income tax in the United States

Moment methods in extremal geometry David de Laat Delft University of Technology (Joint with Fernando Oliveira and Frank Vallentin) 51st Dutch Mathematical Congress

Source URL: www.daviddelaat.nl

• Mathematics
• Geometry
• Discrete geometry
• NP-complete problems
• Circle packing
• Conjectures
• Operations research
• Sphere packing
• Independent set
• Tammes problem
• Kepler conjecture
• Semidefinite programming

1 Optimizing Busy Time on Parallel Machines George B. Mertzios∗ , Mordechai Shalom† , Ariella Voloshin‡ , Prudence W.H. Wong§ and Shmuel Zaks‡ ∗ School of Engineering and Computing Sciences, Durham University

Source URL: cgi.csc.liv.ac.uk

• Graph theory
• Mathematics
• Operations research
• Mathematical optimization
• NP-complete problems
• Dynamic programming
• Equations
• Systems engineering
• Independent set
• Interval scheduling
• Interval graph
• Approximation algorithm

CS261: Exercise Set #5 For the week of February 1–5, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza.

Source URL: theory.stanford.edu

• Mathematical optimization
• Convex optimization
• Operations research
• Mathematical analysis
• Linear programming
• Ellipsoid method
• Relaxation
• Duality

Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,? , Pim van ’t Hof1,? , Marcin Kami´ nski2,?? , and Dani¨el Paulusma3,? ? ? 1

Source URL: rutcor.rutgers.edu

• Graph theory
• Graph operations
• Cograph
• Line graph
• Forbidden graph characterization
• Graph
• Distance-hereditary graph
• Pathwidth

From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡

Source URL: www.qiqiyan.com.s3-website-us-east-1.amazonaws.com

• Mathematical optimization
• Mathematics
• Operations research
• Linear programming
• Convex optimization
• Combinatorial optimization
• Computational complexity theory
• Submodular set function
• Randomized rounding
• Optimization problem
• Matroid
• Ellipsoid method